Query Selectivity Estimation for Uncertain Data
نویسندگان
چکیده
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (probabilistic) data as a native data type. New automatic query optimizations having the ability to estimate the cost of execution of a given query plan, as available in existing databases, need to be developed. For probabilistic data this involves providing selectivity estimations that can handle multiple values for each attribute and also new query types with threshold values. This paper presents novel selectivity estimation functions for uncertain data and shows how these functions can be integrated into PostgreSQL to achieve query optimization for probabilistic queries over uncertain data. The proposed methods are able to handle both attributeand tuple-uncertainty. Our experimental results show that our algorithms are efficient and give good selectivity estimates with low space-time overhead.
منابع مشابه
Query Selectivity Estimation for Uncertain Database
Applications requiring the handling of urzcertain data have led to the developmerlt of database management systerns extending the scope of relational databases to include uncertain (probabilistic) data as a izative data type. New automatic query optirnizatiorzs having the ability to estimate the cost of execution of a given query plan, as available in existing databases, need to be developed. F...
متن کاملA New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion
New Challenges in Petascale Scientific Databases p. 1 Adventures in the Blogosphere p. 2 The Evolution of Vertical Database Architectures A Historical Review p. 3 Query Optimization in Scientific Databases Linked Bernoulli Synopses: Sampling along Foreign Keys p. 6 Query Planning for Searching Inter-dependent Deep-Web Databases p. 24 Summarizing Two-Dimensional Data with Skyline-Based Statistic...
متن کاملApplying CUDA Technology in DCT-Based Method of Query Selectivity Estimation
The problem of efficient calculation of query selectivity estimation is considered in this paper. The selectivity parameter allows database query optimizer to estimate the size of the data satisfying given condition, which is needed to choose the best query execution plan. Obtaining query selectivity in case of a multi-attribute selection condition requires a representation of multidimensional ...
متن کاملQuery Selectivity Estimation Based on Improved V-optimal Histogram by Introducing Information about Distribution of Boundaries of Range Query Conditions
Selectivity estimation is a parameter used by a query optimizer for early estimation of the size of data that satisfies query condition. Selectivity is calculated using an estimator of distribution of attribute values of attribute involved in a processed query condition. Histograms built on attributes values from a database may be such representation of the distribution. The paper introduces a ...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008